Ergodic Theory on Galton-Watson Trees: Speed of Random Walk and Dimension of Harmonic Measure
نویسندگان
چکیده
We consider simple random walk on the family tree T of a nondegenerate supercritical Galton-Watson branching process and show that the resulting harmonic measure has a.s. strictly smaller Hausdorff dimension than that of the whole boundary of T . Concretely, this implies that an exponentially small fraction of the nth level of T carries most of the harmonic measure. First order asymptotics for the rate of escape, Green function and the Avez entropy of the random walk are also determined. Ergodic theory of the shift on the space of random walk paths on trees is the main tool; the key observation is that iterating the transformation induced from this shift to the subset of “exit points” yields a nonintersecting path sampled from harmonic measure.
منابع مشابه
The harmonic measure of balls in random trees
We study properties of the harmonic measure of balls in typical large discrete trees. For a ball of radius n centered at the root, we prove that, although the size of the boundary is of order n, most of the harmonic measure is supported on a boundary set of size approximately equal to n , where β ≈ 0.78 is a universal constant. To derive such results, we interpret harmonic measure as the exit d...
متن کاملBiased Random Walks on Galton - Watson Trees
We consider random walks with a bias toward the root on the family tree T of a supercritical Galton-Watson branching process and show that the speed is positive whenever the walk is transient. The corresponding harmonic measures are carried by subsets of the boundary of dimension smaller than that of the whole boundary. When the bias is directed away from the root and the extinction probability...
متن کاملThe harmonic measure of critical Galton–Watson trees
We consider simple random walk on a critical Galton–Watson tree conditioned to have height greater than n. It is well known that the cardinality of the set of vertices of the tree at generation n is then of order n. We prove the existence of a constant β ≈ 0.78 such that the hitting distribution of the generation n in the tree by simple random walk is concentrated with high probability on a set...
متن کاملRANDOM WALKS ON TREES AND AN INEQUALITY OF MEANS Introduction: Z
. We de ne trees generated by bi-in nite sequences, calculate their walkinvariant distribution and the speed of a biased random walk. We compare a simple random walk on a tree generated by a bi-in nite sequence with a simple random walk on an augmented Galton-Watson tree. We nd that comparable simple random walks require the augmented Galton-Watson tree to be larger than the corresponding tree...
متن کاملOn the Speed of Random Walks on Graphs
Lyons, Pemantle and Peres asked whether the asymptotic lower speed in an innnite tree is bounded by the asymptotic speed in the regular tree with the same average number of branches. In the more general setting of random walks on graphs, we establish a bound on the expected value of the exit time from a vertex set in terms of the size and distance from the origin of its boundary, and prove this...
متن کامل